Numerical calculation of the infinite cluster and its backbone fractal dimension for a square network of percolation
نویسندگان
چکیده
We calculate the fractal dimension of the infinite cluster, minimal path and its backbone for a square network of percolation by using box counting algorithms. We find for d=2, Dmin= 1.136; Df= 1.7197 ; Dbb= 1.63. The numerical values of these exponents are in good agreement with recent theoretical predictions. .
منابع مشابه
Beyond blobs in percolation cluster structure: the distribution of 3-blocks at the percolation threshold.
The incipient infinite cluster appearing at the bond percolation threshold can be decomposed into singly connected "links" and multiply connected "blobs." Here we decompose blobs into objects known in graph theory as 3-blocks. A 3-block is a graph that cannot be separated into disconnected subgraphs by cutting the graph at two or fewer vertices. Clusters, blobs, and 3-blocks are special cases o...
متن کاملComparison Density and Fractal Dimension of Drainage Networks in Different Scales and Precision Different (Case Study: Ilam Watersheds)
Every phenomena in the nature, despite the complexity of the subject, has certain rules and regulations. River pattern and behavior as one of the most complex natural phenomena to this is not an exception. Depending on geomorphologic, climatic, topographic and erosive conditions, the waterways exhibit different patterns and behaviors. One of the parameters which can be achieved using the comple...
متن کاملساختار خوشههای پرکولاسیون تهاجمی در دو بعد
We have performed extensive numerical simulations to estimate the fractal dimension of the mass and also the anisotropy in the shape of sample spanning cluster (SSC) in 2-D site invasion percolation processes with and without trapping. In agreement with the most recent works, we have observed that these two different processes belong to two different universality classes. Furthermore, we have...
متن کاملProbability Distribution of the Shortest Path on the Percolation Cluster, its Backbone and Skeleton
We consider the mean distribution functions Φ(r|l), ΦB(r|l), and ΦS(r|l), giving the probability that two sites on the incipient percolation cluster, on its backbone and on its skeleton, respectively, connected by a shortest path of length l are separated by an Euclidean distance r. Following a scaling argument due to de Gennes for self-avoiding walks, we derive analytical expressions for the e...
متن کاملTake a Look at the New Epl
The scaling behavior of self-avoiding walks (SAWs) on the backbone of percolation clusters in two, three and four dimensions is studied by Monte Carlo simulations. We apply the pruned-enriched Rosenbluth chain growth method (PERM). Our numerical results bring about the estimates of critical exponents, governing the scaling laws of disorder averages of the end-to-end distance of SAW configuratio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014